Multi-dimensional Type Theory: Rules, Categories, and Combinators for Syntax and Semantics
نویسنده
چکیده
We investigate the possibility of modelling the syntax and semantics of natural language by constraints, or rules, imposed by the multi-dimensional type theory Nabla. The only multiplicity we explicitly consider is two, namely one dimension for the syntax and one dimension for the semantics, but the general perspective is important. For example, issues of pragmatics could be handled as additional dimensions. One of the main problems addressed is the rather complicated repertoire of operations that exists besides the notion of categories in traditional Montague grammar. For the syntax we use a categorial grammar along the lines of Lambek. For the semantics we use so-called lexical and logical combinators inspired by work in natural logic. Nabla provides a concise interpretation and a sequent calculus as the basis for implementations. . . . Lambek originally presented his type logic as a calculus of syntactic types. Semantic interpretation of categorial deductions along the lines of the Curry-Howard correspondence was put on the categorial agenda in J. van Benthem (1983) The semantics of variety in categorial grammar, Report 83-29*, Simon Fraser University, Canada. This contribution made it clear how the categorial type logics realize Montagues Universal Grammar program — in fact, how they improve on Montagues own execution of that program in offering an integrated account of the composition of linguistic meaning and form. Montagues adoption of a categorial syntax does not go far beyond notation: he was not interested in offering a principled theory of allowable ‘syntactic operations’ going with the category formalism. * Revised version in [2] M. Moortgat (1997) Categorial Type Logics, in J. van Benthem & A. ter Meulen (eds.) Handbook of Logic and Language, Elsevier. Full paper of short presentation at the International Workshop on Constraint Solving and Language Processing (CSLP 2004). This research was partly sponsored by the IT University of Copenhagen and the CONTROL project: CONstraint based Tools for RObust Language processing http://control.ruc.dk
منابع مشابه
Predictive Combinators: a Method for Efficient Processing of Combinatory Categorial Grammars
A B S T R A C T Steedman (1985, 1987) and others have proposed that Categorial Grammar, a theory of syntax in which grammatical categories are viewed as functions, be augmented with operators such as functional composition and type raising in order to analyze • noncanonical" syntactic constructions such as whextraction and node raising. A consequence of these augmentations is an explosion of se...
متن کاملReverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages
Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...
متن کاملComputational semantics in type theory
This paper aims to show how Montague-style grammars can be completely formalized and thereby declaratively implemented by using the Grammatical Framework GF. The implementation covers the fundamental operations of Montague’s PTQ model: the construction of analysis trees, the linearization of trees into strings, and the interpretation of trees as logical formulas. Moreover, a parsing algorithm i...
متن کاملCategories and types for axiomatic domain theory
Domain Theory provides a denotational semantics for programming languages and calculi containing fixed point combinators and other so-called paradoxical combinators. This dissertation presents results in the category theory and type theory of Axiomatic Domain Theory. Prompted by the adjunctions of Domain Theory, we extend Benton’s linear/nonlinear dualsequent calculus to include recursive linea...
متن کاملDependent Cartesian Closed Categories
We present a generalization of cartesian closed categories (CCCs) for dependent types, called dependent cartesian closed categories (DCCCs), which also provides a reformulation of categories with families (CwFs), an abstract semantics for Martin-Löf type theory (MLTT) which is very close to the syntax. Thus, DCCCs accomplish mathematical elegance as well as a direct interpretation of the syntax...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.CL/0408037 شماره
صفحات -
تاریخ انتشار 2004